Belief Update Using Graphs
نویسنده
چکیده
The purpose of this paper is to introduce a form of update based on the minimization of the geodesic distance on a graph. We provide a characterization of this class using settheoretic operators and show that such operators bijectively correspond to geodesic metrics. As distance is generated by distinguishability, our framework is appropriate in contexts where distance is generated by threshold, and therefore, when measurement is erroneous.
منابع مشابه
Message Scheduling Methods for Belief Propagation
Approximate inference in large and densely connected graphical models is a challenging but highly relevant problem. Belief propagation, as a method for performing approximate inference in loopy graphs, has shown empirical success in many applications. However, convergence of belief propagation can only be guaranteed for simple graphs. Whether belief propagation converges depends strongly on the...
متن کاملBelief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagation
We present a novel inference algorithm for arbitrary, binary, undirected graphs. Unlike loopy belief propagation, which iterates fixed point equations, we directly descend on the Bethe free energy. The algorithm consists of two phases, first we update the pairwise probabilities, given the marginal probabili ties at each unit, using an analytic expres sion. Next, we update the marginal proba ...
متن کاملA Syntactical Approach to Belief Update
In the Belief Change domain, Katsuno and Mendelzon have proposed a set of postulates that should be satisfied by update operators. In 1989, Forbus semantically defined an update operator that satisfies these postulates. In order to calculate the resulting belief base all models of the relevant belief bases must be known. This paper proposes to use the prime implicants and prime implicates norma...
متن کاملMin-Max Propagation
We study the application of min-max propagation, a variation of belief propagation, for approximate min-max inference in factor graphs. We show that for “any” highorder function that can be minimized inO(ω), the min-max message update can be obtained using an efficient O(K(ω + log(K)) procedure, where K is the number of variables. We demonstrate how this generic procedure, in combination with e...
متن کاملActions , belief update , and DDL ∗
Two prominent topics in Krister Segerberg’s works are, on the one hand, actions, and on the other hand, belief change. Both topics are connected in multiple ways; one of these connections is via KGM belief update, since, as we argue, belief update is a specific case of feedback-free action progression. We discuss the links between update and action, and, starting from Segerberg’s works, discuss...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008